Complementation of B Uchi Automata Revisited
نویسنده
چکیده
As an alternative to the two classical proofs for complemen-tation of B uchi automata, due to B uchi himself and to McNaughton, we outline a third approach, based on stratiied alternating automata with a \weak" acceptance condition. Building on work by Muller, Saoudi, Schupp (1986) and Kupferman and Vardi (1997), we present a streamlined version of this complementation proof. An essential point is a de-terminacy result on innnite games with a weak winning condition. In a unifying logical setting, the three approaches are shown to correspond to three diierent types of second-order deenitions of !-languages.
منابع مشابه
On the Complementation of Asynchronous Cellular Büchi Automata
We present direct subset automata constructions for asynchronous (asyn-chronous cellular, resp.) automata. This provides a solution to the problem of direct determinization for automata with distributed control for languages of nite traces. We use the subset automaton construction and apply Klarlund's progress measure technique in order to complement non-deterministic asynchronous cellular B uc...
متن کاملComputer science and the fine structure of Borel sets
(I) Wadge de ned a natural re nement of the Borel hierarchy, now called the Wadge hierarchy WH. The fundamental properties of WH follow from the results of Kuratowski, Martin, Wadge and Louveau. We give a transparent restatement and proof of Wadge’s main theorem. Our method is new for it yields a wide and unexpected extension: from Borel sets of reals to a class of natural but non Borel sets of...
متن کاملOptimizing Büchi Automata
We describe a family of optimizations implemented in a translation from a linear temporal logic to B uchi automata. Such optimized automata can enhance the e ciency of model checking, as practiced in tools such as Spin. Some of our optimizations are applied during preprocessing of temporal formulas, while other key optimizations are applied directly to the resulting B uchi automata independen...
متن کاملFinite - state Automata on In nite Inputs
This paper is a self-contained introduction to the theory of nite-state automata on innnite words. The study of automata on innnite inputs was initiated by B uchi in order to settle certain decision problems arising in logic. Subsequently, there has been a lot of fundamental work in this area, resulting in a rich and elegant mathematical theory. In recent years, there has been renewed interest ...
متن کامل\Direct" Model Checking of Temporal Properties
In this paper, we address the problem of model checking temporal properties of nite-state programs. This problem is usually solved by modelling the program as well as the negation of the desired temporal property as automata on in nite words (B uchi automata) and checking for emptiness of the automaton resulting from the synchronous product of the program automaton and the negated property aut...
متن کامل